Resolving Domination in Graphs under Some Binary Operations
نویسندگان
چکیده
In this paper, we investigate the concept of resolving dominating set in a graph. particular, characterize sets join, corona and lexicographic product two graphs determine domination number these graphs.
منابع مشابه
Resolving Domination in Graphs
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the (metric) representation of v with respect to W is the k-vector r(v|W ) = (d(v,w1), d(v,w2), . . . , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representations with respect to W . A resolv...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملSome recent results on domination in graphs
In this paper, we survey some new results in four areas of domination in graphs, namely: (1) the toughness and matching structure of graphs having domination number 3 and which are “critical” in the sense that if one adds any missing edge, the domination number falls to 2; (2) the matching structure of graphs having domination number 3 and which are “critical” in the sense that if one deletes a...
متن کاملPower domination in some classes of graphs
The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2023
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v16i1.4643